#include<iostream>
#include<vector>
#include<stack>

using namespace std;
#include"sort.h"

int main()
{
	vector<int> v1;
	v1.push_back(9);
	v1.push_back(10);
	v1.push_back(3);
	v1.push_back(9); 
	v1.push_back(955);
	v1.push_back(1024);
	v1.push_back(5);
	v1.push_back(22);
	v1.push_back(9);
	v1.push_back(10);
	v1.push_back(3);
	v1.push_back(9);
	v1.push_back(955);
	v1.push_back(1024);
	v1.push_back(5);
	v1.push_back(22);
	/*v1.push_back(55);
	v1.push_back(35); 
	v1.push_back(54);
	v1.push_back(5);
	v1.push_back(35);*/
	//shell_sort(v1);
	//for (auto a : v1)
	//{
	//	cout << a << ' ';
	//}
	//cout << endl;
	/*fast_sort(v1);
	for (auto a : v1)
	{
		cout << a << ' ';
	}
	cout << endl;

	heep_sort(v1);
	for (auto a : v1)
	{
		cout << a << ' ';
	}
	
	
	*/
	//fast_sort_no(v1);
	//for (auto a : v1)
	//{
	//	cout << a << ' ';
	//}
	//cout << endl;
	//
	/*
	_merge_Sort_no(arr, 8);*/
	int arr[] = { 955, 5, 9, 9, 22, 10, 3, 1024 };
	merge_sort(arr);
	return 0;
}